On-Line Detection and Resolution of Communication Deadlocks

W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i .e . , simultaneously detects and resolves deadlock as communication requests are made, at no additional message t r a f i c overhead, and with bounded delay between the occurrence and detection of a deadlock. This i s achieved via a novel technique for detecting knots, which suf ice for the existence of communication deadlocks. Current distributed deadlock detection algor i thms lack these features. Thus the algorithm is suitable for sofl real-time sys tems and large distributed sys tems. W e also prove that the algorithm detects communication deadlocks and that it i s able t o deal wi th false deadlocks.